Hill Algorithm Decryption using Parallel Calculations by Brute Force

Extended Hill Cipher Decryption by Using Transposed Interweaved Shifting

This paper is discussed about the strength of extended cipher due to non-linear transformation of interweave transposition and shifting operations. The impact of number of iterations on the avalanche effect is investigated. During encryption process the interweaving of the resulting plaintext, at each stage of the iteration, and the multiplication with the key matrix followed by transposition a...

Forming Productive Student Groups Using a Massively Parallel Brute-Force Algorithm

The ability to work in productive groups is critical for success in the software industry, thus computer science students must be given the opportunity to work in productive groups. However, forming productive groups is difficult. A promising new way to form student groups is to use a web application to collect information from individual students and then use an algorithm to form the groups. T...

Brute Force Information Retrieval Experiments using MapReduce

MIREX (MapReduce Information Retrieval Experiments) is a software library initially developed by the Database Group of the University of Twente for running large scale information retrieval experiments on clusters of machines. MIREX has been tested on web crawls of up to half a billion web pages, totaling about 12.5 TB of data uncompressed. MIREX shows that the execution of test queries by a br...

Understanding brute force

. A properly designed 2-dimensional parallel computer of size n can do both jobs in time n. A serial computer for either problem is much, much, much slower and can’t be much smaller: it needs n serial accesses to n bits of memory. A related myth is that analyzing the time of a computation on a huge serial computer is equivalent to analyzing the price and performance of parallel versions of the ...

A Second Brute Force Algorithm for \basket Analysis" (gcl-bf2)